Identifying Layout Classes for Mathematical Symbols Using Layout Context

نویسندگان

  • Ling Ouyang
  • Richard Zanibbi
چکیده

We describe a symbol classification technique for identifying the expected locations of neighboring symbols in mathematical expressions. We use the seven symbol layout classes of the DRACULAEmath notation parser (Zanibbi, Blostein, and Cordy, 2002) to represent expected locations for neighboring symbols: Ascender, Descender, Centered, Open Bracket, Non-Script, Variable Range (e.g. integrals) and Square Root. A new feature based on shape contexts (Belongie et al., 2002) named layout context is used to describe the arrangement of neighboring symbol bounding boxes relative to a reference symbol, and the nearest neighbor rule is used for classification. 1917 mathematical symbols from the University of Washington III document database are used in our experiments. Using a leave-one-out estimate, our best classification rate reaches nearly 80%. In our experiments, we find that the size of the symbol neighborhood, and number and arrangement of key points representing a symbol affect performance significantly.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Handwritten Mathematical Symbol Classification Using Layout Context

A new descriptor, layout context, is introduced to describe the distribution of the surrounding symbols’ positions relative to a target mathematical symbol within a mathematical expression. Using this new descriptor, a coarse classification is performed in which all mathematical symbols are classified into eight classes[3] as shown in Figure 1. These classes represent different centroid locatio...

متن کامل

A Mathematical Model for Integrating Cell Formation Problem with Machine Layout

  This paper deals with the cellular manufacturing system (CMS) that is based on group technology concepts. CMS is defined as identifying the similar parts that are processed on the same machines and then grouping them as a cell. The most proposed models for solving CMS are focused on cell formation problem while machine layout is considered in few papers. This paper addresses a mathematical mo...

متن کامل

Mathematical Programming Models for Solving Unequal-Sized Facilities Layout Problems - a Generic Search Method

 This paper present unequal-sized facilities layout solutions generated by a genetic search program named LADEGA (Layout Design using a Genetic Algorithm). The generalized quadratic assignment problem requiring pre-determined distance and material flow matrices as the input data and the continuous plane model employing a dynamic distance measure and a material flow matrix are discussed. Computa...

متن کامل

A Continuous Plane Model to Machine Layout Problems Considering Pick-Up and Drop-Off Points: An Evolutionary Algorithm

One of the well-known evolutionary algorithms inspired by biological evolution is genetic algorithm (GA) that is employed as a robust and global optimization tool to search for the best or near-optimal solution with the search space. In this paper, this algorithm is used to solve unequalsized machines (or intra-cell) layout problems considering pick-up and drop-off (input/output) points. Such p...

متن کامل

A Mathematical Model for Multiple-Load AGVs in Tandem Layout

Reducing cost of material handling has been a big challenge for companies. Flexible manufacturing system employed automated guided vehicles (AGV) to maintain efficiency and flexibility. This paper presents a new non-linear mathematical programming model to group n machines into N loops, to make an efficient configuration for AGV system in Tandem layout. The model minimizes bot...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009